Towards the uniform implementation of declarative languages

Towards the uniform implementation of declarative languages

Source :

• Computer Languages [ 0096-0551 ] ; 1997.

English descriptors

• Teeft :
  • Abstract machine, Abstract machine model, Abstract machines, Abstraction level, Activation frame, Active object, Active object referenced, Active objects, Additional argument, Algebraic data types, Alt, Alternative computations, Alternative expressions, Appropriate alternative, Aquarius, Aquarius prolog, Argument expression, Argument expressions, Argument stack, Argument values, Argument variables, Arity, Assembler code, Available arguments, Backtracking, Behaviour, Benchmark, Benchmarking implementations, Body expression, Caller, Cant, Case analysis, Case expression, Case expressions, Case selection, Chakravarty, Chakravartyand hendrick, Chakravartyand hendrickc, Choice point, Choice point stack, Choice points, Choices statement, Choices statements, Closure, Code block, Code blocks, Code component, Code form, Code generation, Code generator, Code pointer, Compilation scheme, Compiler, Computer science, Concrete architecture, Concrete architectures, Concrete implementation, Concrete machine architecture, Concrete machine architectures, Constraint, Constraint solver, Continuation argument, Copy propagation, Correct alternative, Curr_cp, Current state, Currying, Data object, Data object representation, Data objects, Data representations, Data structure, Data structures, Data terms, Data type, Declarative languages, Derivation relation, Design space, Different concepts, Different kinds, Disjunction, Efficient implementations, Efficient treatment, Environment arguments, Environment variables, Equality predicate, Equality type, Equality type variables, Equality types, Evaluation code, Evaluation method, Exec, Existential quantification, First argument, Foldr, Form mode, Formal arguments, Formal definition, Free variables, Function applications, Function type, Functional language, Functional languages, Functional logic kernel language, Functional logic language, Functional logic language gtml, Functional logic languages, Functional logic programming, Functional logic programs, Functional part, Functional programming, Functions currying, Funnoupd, Garbage collection, General notion, General unification, Glasgow haskell compiler, Global environment, Gtml, Gtml compiler, Haskell, Heap objects, Helpful comments, Hendrick, Identifier, Implementation, Implementation techniques, Impure features, Inference rules, Information sciences, Innermost strategy, Intermediate code, Intermediate values, Intermediate variables, Jcode, Jcode statement, Jump instruction, Jvars, Kernel, Kernel language, Keywords switch, Lagic programming, Language babel, Last alternative, Lazy evaluation, Lazy evaluation strategy, Less arguments, Lncs, Local bindings, Local context, Local environment, Local value definitions, Logic, Logic computations, Logic features, Logic language, Logic languages, Logic programming, Logic programming languages, Logic programs, Logic rogramming, Logic semantics, Logical variables, Lvar, Lvar slot, Machine code, Machine state, Memory requirements, Method table, Method tables, Minimal core, Mode parameter, More detail, Next alternative, Noupd, Operational behaviour, Operational concepts, Operational semantics, Optimization, Optimization level, Original object, Other term, Parallel implementation, Partial application, Partial data, Partial data structure, Partial data structures, Performance results, Peyton, Peyton jones, Pointer, Postdoc position, Predicate, Predicate definitions, Programming, Programming language implementation, Programming languages, Prolog, Proper arguments, Prototypical compiler, Referenced, Result value, Retlvar, Return address, Return continuation, Return continuations, Return instructions, Return operation, Return stack, Return vector, Return vectors, Rule choice point, Rule choice points, Rule selection, Second rule, Self reference, Semantics, Sigplan notices, Single argument, Special case, Special code form, Special interest, Special kind, Specific language, Specific task, Spineless tagless, Springer, Stack, Stack pointer, Statement list, Statement sequence, Static analysis, Stgm, Straightforward optimizations, Strict evaluation, Strong typing, Suspension object, Switch instructions, Switch statement, Syntactic, Syntactic form, Tagless, Tagless approach, Technical report university, Term alternative, Term alternatives, Terminal symbols, Topmost, Topmost choice point, Topmost return continuation, Transition rules, Transition system, Translation rules, Translation schemes, Trybind, Type expressions, Type variables, Unboxed values, Unevaluated expressions, Unification, Unification method, Unification operation, Unified terms, Uniform implementation, Uniform implementationof declarativelanguages, Uniform representation, Value definition, Value definitions, Value type declaration, Variable, Variable choice point, Variable choice points, Variable identifiers, Variable names, Variable pattern, Vectored returns, Weak head, Workshopon implementations.

Abstract

• https://api.istex.fr/ark:/67375/6H6-B5NPBD3D-8/fulltext.pdf

Affiliations:

• Allemagne, Japon
• Bade-Wurtemberg, District de Karlsruhe
• Karlsruhe

Links toward previous steps (curation, corpus...)

• to stream Istex, to step Corpus: 002C95
• to stream Istex, to step Curation: 002C58
• to stream Istex, to step Checkpoint: 002651
• to stream Main, to step Merge: 00C296
• to stream Main, to step Curation: 00BB19

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00BB19 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00BB19 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:BD450B596E4EBA7E8487E037B0D99F8CF0882BD8
   |texte=   Towards the uniform implementation of declarative languages
}}

This area was generated with Dilib version V0.6.33. Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022